Optimal block-type-decodable encoders for constrained systems
نویسندگان
چکیده
منابع مشابه
Optimal block-type-decodable encoders for constrained systems
A constrained system is presented by a finite-state labeled graph. For such systems, we focus on block-type-decodable encoders, comprising three classes known as block, block-decodable, and deterministic encoders. Franaszek gives a sufficient condition which guarantees the equality of the optimal rates of block-decodable and deterministic encoders for the same block length. In this paper, we in...
متن کاملStabilization of Block-Type-Decodability Properties for Constrained Systems
We consider a class of encoders for constrained systems, which we call block-typedecodable encoders. For a constrained system presented by a deterministic graph, we design a blocktype-decodable encoder by selecting a subset of states of the graph to be used as encoder states. Such a subset is known as a set of principal states. Our goal is to find an optimal set of principal states, i.e., a set...
متن کاملArt of constructing low-complexity encoders/decoders for constrained block codes
A rate : block encoder is a dataword-to-codeword assignment from 2 -bit datawords to 2 -bit codewords, and the corresponding block decoder is the inverse of the encoder. When designing block encoders/decoders for constrained systems, often, more than 2 codewords are available. In this paper, as our main contribution, we propose efficient heuristic computer algorithms to eliminate the excess cod...
متن کاملOptimal stimulus encoders for natural tasks.
Determining the features of natural stimuli that are most useful for specific natural tasks is critical for understanding perceptual systems. A new approach is described that involves finding the optimal encoder for the natural task of interest, given a relatively small population of noisy "neurons" between the encoder and decoder. The optimal encoder, which necessarily specifies the most usefu...
متن کاملParallel constrained coding with application to two-dimensional constraints
A parallel constrained coding scheme is considered where p blocks of raw data are encoded simultaneously into q tracks such that the contents of each track belong to a given constraint S It is shown that as q increases there are parallel block decodable encoders for S whose coding ratio p q converges to the capacity of S Examples are provided where parallel coding allows block decodable encoder...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2003
ISSN: 0018-9448
DOI: 10.1109/tit.2003.810634